A continuous rating method for preferential voting. The complete case

A method is given for quantitatively rating the social acceptance of different options which are the matter of a complete preferential vote. Completeness means that every voter expresses a comparison (a preference or a tie) about each pair of options. The proposed method is proved to have certain desirable properties, which include: the continuity of the rates with respect to the data, a decomposition property that characterizes certain situations opposite to a tie, the Condorcet-Smith principle, and a property of clone consistency. One can view this rating method as a complement for the ranking method introduced in 1997 by Markus Schulze. It is also related to certain methods of one-dimensional scaling or cluster analysis.Comment: This is part one of a revised version of arxiv:0810.2263. Version 3 is the result of certain modifications, both in the statement of the problem and in the concluding remarks, that enhance the results of the paper; the results themselves remain unchange

On the structure of acyclic binary relations

We investigate the structure of acyclic binary relations from different points of view. On the one hand, given a nonempty set we study real-valued bivariate maps that satisfy suitable functional equations, in a way that their associated binary relation is acyclic. On the other hand, we consider acyclic directed graphs as well as their representation by means of incidence matrices. Acyclic binary relations can be extended to the asymmetric part of a linear order, so that, in particular, any directed acyclic graph has a topological sorting.This work has been partially supported by the research projects MTM2012-37894-C02-02, TIN2013-47605-P, ECO2015-65031-R, MTM2015-63608-P (MINECO/FEDER), TIN2016-77356-P and the Research Services of the Public University of Navarre (Spain)

Behavioral implications of shortlisting procedures

We consider two-stage “shortlisting procedures” in which the menu of alternatives is first pruned by some process or criterion and then a binary relation is maximized. Given a particular first-stage process, our main result supplies a necessary and sufficient condition for choice data to be consistent with a procedure in the designated class. This result applies to any class of procedures with a certain lattice structure, including the cases of “consideration filters,” “satisficing with salience effects,” and “rational shortlist methods.” The theory avoids background assumptions made for mathematical convenience; in this and other respects following Richter’s classical analysis of preference-maximizing choice in the absence of shortlisting

Set optimization - a rather short introduction

Recent developments in set optimization are surveyed and extended including various set relations as well as fundamental constructions of a convex analysis for set- and vector-valued functions, and duality for set optimization problems. Extensive sections with bibliographical comments summarize the state of the art. Applications to vector optimization and financial risk measures are discussed along with algorithmic approaches to set optimization problems